Divide-and-Conquer Hartree–Fock–Bogoliubov Method and Its Application to Conjugated Diradical Systems

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

construction and validation of translation metacognitive strategy questionnaire and its application to translation quality

like any other learning activity, translation is a problem solving activity which involves executing parallel cognitive processes. the ability to think about these higher processes, plan, organize, monitor and evaluate the most influential executive cognitive processes is what flavell (1975) called “metacognition” which encompasses raising awareness of mental processes as well as using effectiv...

Cut Problemsand Their Application to Divide-and-conquer

Divide-and-conquer is one of the most basic techniques in thedesign and analysisof algorithms, and yet, until recently, therehavebeen essentially no performanceguaranteesknown for approximation algorithms based on this approach. This chapter will present approximation algorithmsfor several NPhard graph-theoretic cut problems, and their subsequent application asa tool for the “divide” part of di...

متن کامل

petrology and geochemistry of khar-bash (western shahrood) and its relation ship to iron mineralization

منطقه مورد مطالعه در 23 کیلومتری جنوب غرب شهرستاشاهرود قرار دارد که در نقشه 100000/1 شاهرود قرار گرفته است.ناحیه مورد مطالعه در تقسیمات ساختاری ایران بخشی از زون البرز شرقی است . در طی سنوزوئیک این زون به شدت تحت تأثیر فازهای کوهزایی آلپی قرار گرفته و فعالیت های آتشفشانی انوسن در قسمت های غربی آن دیده می شود . از نظر ترکیب سنگ شناسی منطقه مورد مطالعه متنوع و بیشتر شامل سنگ های رسوبی مانند : آ...

15 صفحه اول

A Divide and Conquer Method to Compute Binomial Ideals

A binomial is a polynomial with at most two terms. In this paper, we give a divide-and-conquer strategy to compute binomial ideals. This work is a generalization of the work done by the authors in [12, 13] and is motivated by the fact that any algorithm to compute binomial ideals spends a significant amount of time computing Gröbner basis and that Gröbner basis computation is very sensitive to ...

متن کامل

Divide and Conquer

An instance of the given problem is divided into easier instances of the same problem, which are solved recursively and then combined to create a solution to the original instance. Of course, divide and conquer is not suitable for every problem. A divide and conquer approach will only work if the problem is easily divided into a small number of easier sub-problems, and the solution to the entir...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Chemistry Letters

سال: 2016

ISSN: 0366-7022,1348-0715

DOI: 10.1246/cl.160699